/**
 * https://leetcode.cn/problems/combination-sum-iv/description/
 * 377. 组合总和 Ⅳ
 * medium, 赖德檀 2024/12/04
 * 动态规划
 */
class Solution {
public:
    int combinationSum4(vector<int>& nums, int target) {
        vector<int>dp(target+1,0);
        dp[0]=1;
        for(int i=1;i<=target;i++)
        {
            for(int j=0;j<nums.size();j++)
            {
                if(i-nums[j]>=0&&dp[i]<INT_MAX-dp[i-nums[j]])
                dp[i]+=dp[i-nums[j]];
            }
        }
        return dp[target];
    }
};